منابع مشابه
Euclidean Movement Minimization
We consider a class of optimization problems called movement minimization on euclidean plane. Given a set of nodes on the plane, the aim is to achieve some specific property by minimum movement of the nodes. We consider two specific properties, namely the connectivity (Con) and realization of a given topology (Topol). By minimum movement, we mean either the sum of all movements (Sum) or the max...
متن کاملOn Euclidean Embeddings and Bandwidth Minimization
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log n √ log logn) approximation for minimum bandwidth in conjunction with a semi-definite relaxation, (2) an O(log n) approximation in O(n) time using a new constraint set, (3) a lower bound of Θ( √ logn) on the least possible volume distortion for Euclidean metrics, (4) a new embedding with O( √...
متن کاملStability of Linear-Quadratic Minimization over Euclidean Balls
Stability properties of the problem of minimizing a (nonconvex) linear-quadratic function over an Euclidean ball, known as the trust-region subproblem, are studied in this paper. We investigate in detail the case where the linear part of the objective function is perturbed and obtain necessary and sufficient conditions for the upper/lower semicontinuity of the Karush-Kuhn-Tucker point set map a...
متن کاملMovement minimization for unit distances in conveyor flow shop processing
We consider the movement minimization problem in a conveyor flow shop processing controlled by one worker for all machines. A machine can only execute tasks if the worker is present. Each machine can serve as a bu¤er. The objective is to minimize the total number of movements of the worker for the processing of all jobs. Such minimization problems usually appear in conveyor controlled manufactu...
متن کاملMinimization Time and Battery for a Straight Movement in MANET
In this work we propose two problems that related to a theoretical mobility model previously proposed by Greenlaw and Kantabutra and add some definitions to make the model more complete. The first problem is the minimum time maximum coverage (MTMC) problem to minimize time to move a group of sources which covered a terrain to cover another terrain while all sources can still communicate through...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2015
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-015-9842-5